Minutes from “Multi-agent Oriented Constraint Satisfaction”
نویسندگان
چکیده
The paper begins with a definition of a constraint satisfaction problem. Lin noted that we were all quite familiar with this definition, but discussing it helped to use up time in his presentation. The paper describes two general methods for solving a CSP: generate and test (GT), and backtracking search (BT). GT generates possible combinations of variables and checks whether it has found a solution. BT systematically searches for solutions. There are several improvements that have been made to increase the performance of BT. Thrashing can be mitigated by application of consistency techniques. Redundant work can be avoided by using a dependency directed backtracking scheme. Of course, general CSP problems are NP-complete, so even with these enhancements BT is still unable to solve sufficiently large problems. GT can be improved by making use of heuristics and stochastic algorithms. Local search methods typically use iterative repair or hill climbing techniques. To escape from local optima, these techniques will generally make use of a random walk or random restart.
منابع مشابه
LITERATURE REVIEW AND SURVEY Course Instructor: Dr. Richard Frost Multi-Agent Oriented Constraint Satisfaction with the ERA Formulation By,
In distributed multi-agent environments, several problems relating to the co-ordination of agent tasks can be modeled as constraint satisfaction problems. There have been several approaches that have addressed constraint-satisfaction problems [42] in distributed multi-agent environments. The ERA formulation [20] is a new strategy that models the constraint-satisfaction problem as Agents with Re...
متن کاملAgent Compromises in Distributed Problem Solving
ERA is a multi-agent oriented method for solving constraint satisfaction problems [5]. In this method, agents make decisions based on the information obtained from their environments in the process of solving a problem. Each agent has three basic behaviors: least-move, better-move, and random-move. The random-move is the unique behavior that may help the multi-agent system escape from a local m...
متن کاملEscaping Local Optima in Multi-Agent Oriented Constraint Satisfaction
We present a multi-agent approach to constraint satisfaction where feedback and reinforcement are used in order to avoid local optima and, consequently, to improve the overall solution. Our approach, FeReRA, is based on the fact that an agent’s local best performance does not necessarily contribute to the system’s best performance. Thus, agents may be rewarded for improving the system’s perform...
متن کاملMulti-agent oriented constraint satisfaction
This paper presents a multi-agent oriented method for solving CSPs (Constraint Satisfaction Problems). In this method, distributed agents represent variables and a two-dimensional grid-like environment in which the agents inhabit corresponds to the domains of the variables. Thus, the positions of the agents in such an environment constitute the solution to a CSP. In order to reach a solution st...
متن کاملA Framework for Automatic Problem Decomposition in Planning
An intelligent problem solver must be able to decompose a complex problem into simplex parts. A decomposition algorithm would not only be beneficial for traditional subgoal-oriented planning systems but also support distributed, multi-agent planners. In this paper, we present an algorithm for automatic problem decomposition. Given a domain description with a number of objects to be manipulated,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002